package com.jiang.daily.Q3046;

/**
 * @author Jiang
 * @version 1.0
 * @date 2024/12/28 16:39
 */
class Solution {
    public boolean isPossibleToSplit(int[] nums) {
        if (nums.length == 1) return false;
        int[] temp = new int[101];
        for (int i = 0; i < nums.length; i++) {
            if (++temp[nums[i]] > 2) return false;
        }
        return true;
    }
}
